Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited
نویسندگان
چکیده
In this paper, we revisit global as well as local schedulability analysis of synchronization protocols based on the stack resource protocol (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority pre-emptive scheduling (FPPS). We show that both the existing global and local schedulability analysis are pessimistic, present improved analysis, and illustrate the improvements by means of examples.
منابع مشابه
Overrun Methods for Semi-Independent Real-Time Hierarchical Scheduling
The Hierarchical Scheduling Framework (HSF) has been introduced as a design-time framework to enable compositional schedulability analysis of embedded software systems with real-time properties. In this paper a software system consists of a number of semi-independent components called subsystems. Subsystems are developed independently and later integrated to form a system. To support this desig...
متن کاملSynchronization Protocols for a Compositional Real-Time Scheduling Framework
In this thesis we propose techniques to simplify the integration of subsystems while minimizing the overall amount of CPU resources needed to guarantee the schedulability of real-time tasks. In addition, we provide solutions to the problem of allowing for the use of logical resources requiring mutual exclusion. The contribution of the thesis is presented in three parts. In the first part, we pr...
متن کاملInterface Algebra for Analysis of Hierarchical Real-Time Systems
Complex real-time embedded systems can be developed using component based design methodologies. Timing requirements of real-time components in the system can be modeled using hierarchical frameworks to capture resource sharing among components under different schedulers. To support component based design for real-time embedded systems, we must then address schedulability analysis of hierarchica...
متن کاملCompositional Schedulability Analysis Supporting Associativity, Optimality, Dependency and Concurrency
COMPOSITIONAL SCHEDULABILITY ANALYSIS SUPPORTING ASSOCIATIVITY, OPTIMALITY, DEPENDENCY AND CONCURRENCY Arvind Easwaran Insup Lee Oleg Sokolsky Real-time systems have always played an important but limited role in our lives. They were often used in very restricted application domains such as space. However, with rapidly decreasing cost of computation hardware, embedded systems with timing constr...
متن کاملCompositional Feasibility Analysis for Conditional Real-Time Task Models
Conditional real-time task models, which are generalizations of periodic, sporadic, and multi-frame tasks, represent real world applications more accurately. These models can be classified based on a tradeoff in two dimensions – expressivity and hardness of schedulability analysis. In this work, we introduce a class of conditional task models and derive efficient schedulability analysis techniq...
متن کامل